Star multigraphs with three vertices of maximum degree
نویسندگان
چکیده
منابع مشابه
Star multigraphs with three vertices of maximum degree
The graphs we consider here are either simple graphs, that is they have no loops or multiple edges, or are multigraphs, that is they may have more than one edge joining a pair of vertices, but again have no loops. In particular we shall consider a special kind of multigraph, called a star-multigraph: this is a multigraph which contains a vertex v*, called the star-centre, which is incident with...
متن کاملCycles containing all vertices of maximum degree
For a graph Gand an integer k, denote by Vk the set {u E V(G) I d(u) 2 k}. Veldman proved that if G is a 2-connected graph of order n with n 5 3k 2 and IVkl 5 k, then G has a cycle containing all vertices of Vk. It is shown that the upper bound k on IVkl is close to best possible in general. For the special case k = A(G), it is conjectured that the condition lVkl I k can be omitted. Using a var...
متن کاملDegree sequences of multigraphs
Let a, b and n be integers, n ≥ 1 and b ≥ a ≥ 0. Let an (a, b, n)-graph defined as a loopless graph G(a, b, n) on n vertices {V1, . . . , Vn}, in which Vi and Vj are connected with at least a and at most b (directed or undirected) edges. If G(a, b, n) is directed, then it is called (a, b, n)-digraph and if it is undirected, then it is called (a, b, n)undigraph. Landau in 1953 published an algor...
متن کاملReducing the maximum degree of a graph by deleting vertices
We investigate the smallest number λ(G) of vertices that need to be removed from a non-empty graph G so that the resulting graph has a smaller maximum degree. We prove that if n is the number of vertices, k is the maximum degree, and t is the number of vertices of degree k, then λ(G) ≤ n+(k−1)t 2k . We also show that λ(G) ≤ n k+1 if G is a tree. These bounds are sharp. We provide other bounds t...
متن کاملc-Critical Graphs with Maximum Degree Three
Let G be a (simple) graph with maximum degree three and chromatic index four. A 3-edge-coloring of G is a coloring of its edges in which only three colors are used. Then a vertex is conflicting when some edges incident to it have the same color. The minimum possible number of conflicting vertices that a 3edge-coloring of G can have, d(G), is called the edge-coloring degree of G. Here we are mai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Proceedings of the Cambridge Philosophical Society
سال: 1986
ISSN: 0305-0041,1469-8064
DOI: 10.1017/s030500410006610x